package leetCode.offer60;

import java.util.ArrayList;
import java.util.Arrays;
import java.util.List;

/**
 * 把n个骰子扔在地上，所有骰子朝上一面的点数之和为s。输入n，打印出s的所有可能的值出现的概率。
 * 你需要用一个浮点数数组返回答案，其中第 i 个元素代表这 n 个骰子所能掷出的点数集合中第 i 小的那个的概率。
 *
 * 示例 1:
 * 输入: 1
 * 输出: [0.16667,0.16667,0.16667,0.16667,0.16667,0.16667]
 *
 * 示例2:
 * 输入: 2
 * 输出: [0.02778,0.05556,0.08333,0.11111,0.13889,0.16667,0.13889,0.11111,0.08333,0.05556,0.02778]
 *
 * 限制：
 * 1 <= n <= 11
 */
public class Solution1 implements Solution {

    @Override
    public double[] dicesProbability(int n) {
        double[] result = new double[6+(n-1)*5];
        double basePer = Math.pow((1.00/6),n);
        double i = 1;
        int index = 0;
        int start = 1;
        while (i>0) {

        }
        return result;
    }

    public static void main(String[] args) {
        Solution solution = new Solution1();
        System.out.println(Arrays.toString(solution.dicesProbability(2)));
    }
}
